IMPROVING NEAREST NEIGHBOUR SEARCH IN 3D SPATIAL ACCESS METHOD
نویسندگان
چکیده
منابع مشابه
Nearest Neighbour Search for Visualization Using Arbitrary Triangulations Nearest Neighbour Search for Visualization Using Arbitrary Triangulations
In visualization of scattered data, one is often faced with the problem of nding the nearest neighbours of a data site. This task frequently occurs in an advanced stage of the visualization process, where several data structures have been created during run time. Many applications compute a triangulation of the data for their visualization purposes. To take advantage of this previously allocate...
متن کاملNearest Neighbour Search For XML Trees
There is a significant research effort on efficient computing of similarities between objects of non traditional data types as strings, documents, sound tracks or pictures. It is reasonable to use the results of these efforts in the problem of XML tree matching, too. As an XML document has a tree structure and the trees can be transformed into a linear structure, a tree can be regarded as a spe...
متن کاملForecasting using a Fuzzy Nearest Neighbour Method
1 Singh, S. "Forecasting using a Fuzzy Nearest Neighbour Method", Proc. 6th International Conference on Fuzzy Theory and Technology , Fourth Joint Conference on Information Sciences (JCIS'98), North Carolina, vol. 1, pp.80-83, 1998 (23-28 October ,1998) ABSTRACT This paper explores a nearest neighbour pattern recognition method for time-series forecasting. A nearest neighbour method (FNNM) base...
متن کاملSome Improvements in Tree Based Nearest Neighbour Search Algorithms
Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. In this paper we are interested on tree based algorithms that only make use of the metric properties of the space. One of the most known and refereed method in this class was proposed by Fukunaga and Narendra in the 70’s. This algorithm uses a tree that is traversed on search time and uses some elimina...
متن کاملFractal Approximate Nearest Neighbour Search in Log-Log Time
Nearest neighbour searches in the image plane are among the most frequent problems in a variety of computer vision and image processing tasks. They can be used to replace missing values in image filtering, or to group close objects in image segmentation, or to access neighbouring points of interest in feature extraction. In particular, we address two nearest neighbour problems: The nearest neig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
سال: 2016
ISSN: 2194-9034
DOI: 10.5194/isprs-archives-xlii-2-w1-69-2016